Mental logic and its difficulties with disjunction

Logic Programs with Ordered Disjunction

Propositional primal logic with disjunction

Gurevich and Neeman introduced Distributed Knowledge Authorization Language (DKAL). The world of DKAL consists of communicating principals computing their own knowledge in their own states. DKAL is based on a new logic of information, the so-called infon logic, and its efficient subsystem called primal logic. In this paper we simplify Kripkean semantics of primal logic and study various extensi...

The complexity of primal logic with disjunction

We investigate the complexity of primal logic with disjunction according to the Kripke semantics as defined in [1] and the quasi-boolean semantics as defined in [2]. We show that the validity problem is coNP-complete, even for variable-free sequents. For quasi-boolean semantics, the satisfiability problem is shown to be NPcomplete (even for variable-free sequents), whereas for Kripke semantics ...

Nested Logic Programs with Ordered Disjunction

In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LPODs), which allows to specify qualitative preferences by means of nested preference expressions. For doing this we extend the syntax of logic programs with ordered disjunction (LPODs) to capture more general expressions. We define the LPODs semantics in a simple way and we extend most of ...

Logic Programs with Possibilistic Ordered Disjunction

Logic programs with ordered disjunction have shown to be a flexible specification language able to model common user preferences in a natural way. However, in some realistic scenarios the preferences should be linked to the evidence of the information when trying to reach a single preferred solution. In this paper, we extend the syntax and the semantics of logic programs with ordered disjunctio...